Algorithms for Constructing Optimal Packing into Ellipses
نویسندگان
چکیده
منابع مشابه
Packing circles within ellipses
The problem of packing circles within ellipses is considered in the present paper. A new parametrization is employed by means of which the ellipse is represented by a rectangle. Algorithms with global convergence properties are presented. Numerical experiments are exhibited.
متن کاملOptimal Online Algorithms for Multidimensional Packing Problems
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...
متن کاملGreedy algorithms for packing unequal circles into a rectangular container
In this paper, we study the problem of packing unequal circles into a 2D rectangular container. We solve this problem by proposing two greedy algorithms. The first algorithm, denoted by B1.0, selects the next circle to place according to the maximum hole degree rule, which is inspired from human activity in packing. The second algorithm, denoted by B1.5, improves B1.0 with a self look-ahead sea...
متن کاملOptimal, Output-sensitive Algorithms for Constructing Planar Hulls in Parallel
In this paper we focus on the problem of designing very fast parallel algorithms for the planar convex hull problem that achieve the optimal O(n log H) work-bound for input size n and output size H. Our algorithms are designed for the arbitrary CRCW PRAM model. We first describe a very simple ©(log n log H) time optimal deterministic algorithm for the planar hulls which is an improvement over t...
متن کاملWhole-Plot Exchange Algorithms for Constructing D-Optimal Multistratum Designs
Multistratum experiments contain several different sizes of experimental units. Examples include split-plot, strip-plot designs, and randomized block designs. We propose a strategy for constructing a D-optimal multistratum design by improving a randomly generated design through a sequence of whole-plot exchanges. This approach preserves the design structure and simplifies updates to the informa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2018
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2018.11.488